Kripke Models, Distributive Lattices, and Medvedev Degrees
نویسنده
چکیده
We define a variant of the standard Kripke semantics for intuitionistic logic, motivated by the connection between constructive logic and the Medvedev lattice. We show that while the new semantics is still complete, it gives a simple and direct correspondence between Kripke models and algebraic structures such as factors of the Medvedev lattice.
منابع مشابه
Embeddings into the Medvedev and Muchnik lattices of Π1 classes
Let Pw and PM be the countable distributive lattices of Muchnik and Medvedev degrees of non-empty Π1 subsets of 2 , under Muchnik and Medvedev reducibility, respectively. We show that all countable distributive lattices are lattice-embeddable below any non-zero element of Pw. We show that many countable distributive lattices are lattice-embeddable below any non-zero element of PM .
متن کاملDuality and Canonical Extensions of Bounded Distributive Lattices with Operators, and Applications to the Semantics of Non-Classical Logics I
The main goal of this paper is to explain the link between the algebraic and the Kripke-style models for certain classes of propositional logics. We start by presenting a Priestley-type duality for distributive lattices endowed with a general class of well-behaved operators. We then show that nitely-generated varieties of distributive lattices with operators are closed under canonical embedding...
متن کاملRepresentation Theorems and Theorem Proving in Non-Classical Logics
In this paper we present a method for automated theorem proving in non-classical logics having as algebraic models bounded distributive lattices with certain types of operators. The idea is to use a Priestley-style representation for distributive lattices with operators in order to define a class of Kripke-style models with respect to which the logic is sound and complete. If this class of Krip...
متن کاملA splitting theorem for the Medvedev and Muchnik lattices
This is a contribution to the study of the Muchnik and Medvedev lattices of non-empty Π1 subsets of 2 ω. In both these lattices, any non-minimum element can be split, i.e. it is the non-trivial join of two other elements. In fact, in the Medvedev case, if P >M Q, then P can be split above Q. Both of these facts are then generalised to the embedding of arbitrary finite distributive lattices. A c...
متن کاملDuality and Canonical Extensions of Bounded Distributive Lattices with Operators, and Applications to the Semantics of Non-Classical Logics II
The main goal of this paper is to explain the link between the algebraic models and the Kripke-style models for certain classes of propositional non-classical logics. We consider logics that are sound and complete with respect to varieties of distributive lattices with certain classes of well-behaved operators for which a Priestley-style duality holds, and present a way of constructing topologi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Studia Logica
دوره 85 شماره
صفحات -
تاریخ انتشار 2005